A computer search for complex Golay sequences
نویسندگان
چکیده
We report on a computer search for complex Golay sequences of short length. All such sequences of length 11 and 13 will be classified.
منابع مشابه
Complex Golay sequences: structure and applications
Complex Golay sequences were introduced in 1992 to generalize constructions for Hadamard matrices using Golay sequences. (In the last section of this paper we describe some independent earlier work on quadriphase pairs–equivalent objects used in the setting of signal processing.) Since then we have constructed some new in7nite classes of these sequences and learned some facts about their struct...
متن کاملA construction of binary Golay sequence pairs from odd-length Barker sequences
Binary Golay sequence pairs exist for lengths 2, 10 and 26 and, by Turyn’s product construction, for all lengths of the form 21026 where a, b, c are non-negative integers. Computer search has shown that all inequivalent binary Golay sequence pairs of length less than 100 can be constructed from five “seed” pairs, of length 2, 10, 10, 20 and 26. We give the first complete explanation of the orig...
متن کاملA new source of seed pairs for Golay sequences of length 2m
In 2007 Jedwab and Parker proposed [10] that the natural viewpoint for a Golay complementary sequence is as a projection of a multi-dimensional Golay array. In 2008 Fiedler, Jedwab and Parker [5] used this viewpoint to show how to construct and enumerate all known 2-phase Golay sequences of length 2, starting from two sources of Golay seed pairs. The first source of seed pairs is the trivial Go...
متن کاملEquivalent Transformation Pairs of a q-ary Sequence and its Complex Polyphase Form and their Application
The Golay complementary sequences have been studied for more than five decades since Golay first discovered those sequences. However, few studies on the correlation function of transformation form of q-ary complementary sequences. New notions of equivalent transformation on q-ary sequences and equivalent transformation pair of a q-ary sequence and its complex polyphase form are put forward. A t...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 10 شماره
صفحات -
تاریخ انتشار 1994